Optimal Strategies for Symmetric Matrix Games with Partitions
نویسندگان
چکیده
منابع مشابه
The Distribution of Optimal Strategies in Symmetric Zero-sum Games
Given a skew-symmetric matrix, the corresponding two-player symmetric zero-sum game is defined as follows: one player, the row player, chooses a row and the other player, the column player, chooses a column. The payoff of the row player is given by the corresponding matrix entry, the column player receives the negative of the row player. A randomized strategy is optimal if it guarantees an expe...
متن کاملOptimal Partitions in Additively Separable Hedonic Games
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partition with maximum egalitarian or utilitarian social welfare is NP-hard in the strong sense whereas a Pareto optimal partition can be computed in polynomial time when preferences are strict. Perhaps surprisingly, checking...
متن کاملBI-MATRIX GAMES WITH INTUITIONISTIC FUZZY GOALS
In this paper, we present an application of intuitionistic fuzzyprogramming to a two person bi-matrix game (pair of payoffs matrices) for thesolution with mixed strategies using linear membership and non-membershipfunctions. We also introduce the intuitionistic fuzzy(IF) goal for a choiceof a strategy in a payoff matrix in order to incorporate ambiguity of humanjudgements; a player wants to max...
متن کاملFinding Optimal Strategies for Imperfect Information Games
Ian Frank Complex Games Lab Electrotechnical Laboratory Umezono 1-1-4, Tsukuba Ibaraki, JAPAN 305 [email protected] David Basin Institut f ur Informatik Universitat Freiburg Am Flughafen 17 Freiburg, Germany [email protected] Hitoshi Matsubara Complex Games Lab Electrotechnical Laboratory Umezono 1-1-4, Tsukuba Ibaraki, JAPAN 305 [email protected] Abstract We examine three heuris...
متن کاملOptimal strategies for equal-sum dice games
In this paper we consider a non-cooperative two-person zero-sum matrix game, called dice game. In an (n, σ) dice game, two players can independently choose a dice from a collection of hypothetical dice having n faces and with a total of σ eyes distributed over these faces. They independently roll their dice and the player showing the highest number of eyes wins (in case of a tie, none of the pl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Belgian Mathematical Society - Simon Stevin
سال: 2009
ISSN: 1370-1444
DOI: 10.36045/bbms/1235574193